LOQO:an interior point code for quadratic programming
نویسندگان
چکیده
منابع مشابه
Loqo: an Interior Point Code for Quadratic Programming
ABSTRACT. This paper describes a software package, called LOQO, which implements a primaldual interior-point method for general nonlinear programming. We focus in this paper mainly on the algorithm as it applies to linear and quadratic programming with only brief mention of the extensions to convex and general nonlinear programming, since a detailed paper describing these extensions were publis...
متن کاملSteplength selection in interior-point methods for quadratic programming
We present a new strategy for choosing primal and dual steplengths in a primal-dual interior-point algorithm for convex quadratic programming. Current implementations often scale steps equally to avoid increases in dual infeasibility between iterations. We propose that this method can be too conservative, while safeguarding an unequally-scaled steplength approach will often require fewer steps ...
متن کاملNewton-KKT interior-point methods for indefinite quadratic programming
Two interior-point algorithms are proposed and analyzed, for the (local) solution of (possibly) indefinite quadratic programming problems. They are of the Newton-KKT variety in that (much like in the case of primal-dual algorithms for linear programming) search directions for the “primal” variables and the Karush-Kuhn-Tucker (KKT) multiplier estimates are components of the Newton (or quasi-Newt...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملSteplengths in interior-point algorithms of quadratic programming
An approach to determine primal and dual stepsizes in the infeasible{ interior{point primal{dual method for convex quadratic problems is presented. The approach reduces the primal and dual infeasibilities in each step and allows diierent stepsizes. The method is derived by investigating the eecient set of a multiobjective optimization problem. Computational results are also given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 1999
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556789908805759